例句與造句

1. two-dimensional packing problem arises from a variety of situations including apparel industry, parts nesting problems and super large-scale integration ( slsi ) . packing belongs to np-complete ( nondeterministic polynomial time complete ) problem, which is too difficult to be expressed accurately in simple information model . in addition, the part that can be expressed in mathematical model belongs to np-complete problem
   布局問題來源于現(xiàn)代生產(chǎn)的許多領域并且表現(xiàn)為多種形式，如服裝行業(yè)，部件拼裝和超大規(guī)模集成電路(slsi)，但是由于布局問題具有高度的復雜性，屬于組合優(yōu)化問題和np完全問題，它很難用單一的知識模型(如數(shù)學模型)來精確表達，另外，可用數(shù)學模型表達的部分具有np完全計算復雜度。
2. It's difficult to find nondeterministic polynomial time in a sentence. 用nondeterministic polynomial time造句挺難的